Tutte polynomials for trees
نویسندگان
چکیده
We define two two-variable polynomials for rooted trees and one twovariable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determines the rooted tree, i.e., rooted trees TI and T, are isomorphic if and only if f(T,) = f(T2). The corresponding question is open in the unrooted case, although we can reconstruct the degree sequence, number of subtrees of size k for all k , and the number of paths of length k for all k from the (unrooted) polynomial. The key difference between these three polynomials and the standard Tutte polynomial is the rank function used; we use pruning and branching ranks to define the polynomials. We also give a subtree expansion of the polynomials and a deletion-contraction recursion they satisfy.
منابع مشابه
Tutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملComputing the Tutte polynomial of a hyperplane arrangement
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then reduced to certain related enumerative questions. As a consequence, we obtain new formulas for the generating functions enumerating alternating trees, labelled tre...
متن کاملTutte Polynomials and Related Asymptotic Limiting Functions for Recursive Families of Graphs
We prove several theorems concerning Tutte polynomials T (G, x, y) for recursive families of graphs. In addition to its interest in mathematics, the Tutte polynomial is equivalent to an important function in statistical physics, the Potts model partition function of the q-state Potts model, Z(G, q, v), where v is a temperature-dependent variable. We determine the structure of the Tutte polynomi...
متن کاملVisualising the Tutte Polynomial Computation
The Tutte polynomial is an important concept in graph theory which captures many important properties of graphs (e.g. chromatic number, number of spanning trees etc). It also provides a normalised representation that can be used as an equivalence relation on graphs and has applications in diverse areas such micro-biology and physics. A highly efficient algorithm for computing Tutte polynomials ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 15 شماره
صفحات -
تاریخ انتشار 1991